Resolution Refinements for Cut-Elimination based on Reductive Methods
نویسندگان
چکیده
Traditional reductive cut-elimination and CERES seem to be methods of entirely different nature and hence hard to compare. This short paper describes ongoing research that aims at comparing and possibly combining them in ways that retain that best features of each method.
منابع مشابه
Clausal Analysis of First-order Proof Schemata
Proof schemata are a variant of LK-proofs able to simulate various induction schemes in first-order logic by adding so called proof links to the standard first-order LK-calculus. Proof links allow proofs to reference proofs thus giving proof schemata a recursive structure. Unfortunately, applying reductive cutelimination is non-trivial in the presence of proof links. Borrowing the concept of la...
متن کاملOn proof mining by cut-elimination
We present cut-elimination as a method of proof mining, in the sense that hidden mathematical information can be extracted by eliminating lemmas from proofs. We present reductive methods for cutelimination and the method ceres (cut-elimination by resolution). A comparison of ceres with reductive methods is given and it is shown that the asymptotic behavior of ceres is superior to that of reduct...
متن کاملTowards an algorithmic construction of cut-elimination procedures
We investigate cut-elimination in propositional substructural logics. The problem is to decide whether a given calculus admits (reductive) cut-elimination. We show that, for commutative single-conclusion sequent calculi containing generalized knotted structural rules and arbitrary logical rules, the problem can be decided by resolution-based methods. A general cut-elimination proof for these ca...
متن کاملAutomata, Resolution, and Cut-elimination
Automata, Resolution, and Cut-elimination are three methods to prove the decidability of provability in various logics. The goal of this paper is to understand the relation between these three methods, using Alternating pushdown systems as a unifying example. To this aim, we propose a new Resolution based saturation method for Polarized sequent calculus modulo theory and its associated cut-elim...
متن کاملTowards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof. Every reduction step of a cut-elimination procedure defines an operation on the corresponding clause term. Using this formal framework we prove that the methods of Gentzen and Tait and, more generally, every method b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009